WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            even#1(0()) -> True()
            even#1(S(0())) -> False()
            even#1(S(S(x16))) -> even#1(x16)
            main(x6) -> even#1(x6)
        - Signature:
            {even#1/1,main/1} / {0/0,False/0,S/1,True/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {even#1,main} and constructors {0,False,S,True}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(1)
          False :: [] -(0)-> "A"(0)
          S :: ["A"(1)] -(1)-> "A"(1)
          True :: [] -(0)-> "A"(0)
          even#1 :: ["A"(1)] -(1)-> "A"(0)
          main :: ["A"(1)] -(2)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
        
        

WORST_CASE(?,O(n^1))